Free Logics are Cut-Free
نویسندگان
چکیده
Abstract The paper presents a uniform proof-theoretic treatment of several kinds free logic, including the logics existence and definedness applied in constructive mathematics computer science, called here quasi-free logics. All considered are formalised framework sequent calculus, latter for first time. It is shown that all cases remarkable simplifications starting systems possible due to special rule dealing with identity predicate. Cut elimination proved way calculi adequate under consideration.
منابع مشابه
Logics For Context { Free
We deene matchings, and show that they capture the essence of context{freeness. More precisely, we show that the class of context{ free languages coincides with the class of those sets of strings which can be deened by sentences of the form 9 b', where ' is rst order, b is a binary predicate symbol, and the range of the second order quantiier is restricted to the class of matchings. Several var...
متن کاملCut-free common knowledge
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize” this deductive system. The result is a cut-free, sound and complete sequent calculus for common knowledge.
متن کاملCut - Free Sequent Calculus For
We aim at an exposition of some nonstandard cut-free Gentzen formalization for S5, called DSC (double sequent calculus). DSC operates on two types of sequents instead of one, and shifting of wffs from one side of sequent to another is regulated by special rules and subject to some restrictions. Despite of this apparent inconvenience it seems to be simpler than other, known Gentzen-style systems...
متن کاملLogics For Context-Free Languages
Erklärung Hiermit versichere ich, dass ich die vorliegende Masterarbeit selbstständig verfasst und keine anderen Quellen und Hilfsmittel als die angegebenen benutzt habe.
متن کاملA Cut-Free and Invariant-Free Sequent Calculus for PLTL
Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goal-directed proofs, etc. Unfortunately, in temporal logic, existing sequent calculi make use of a kind of inference rules that prevent the effective mechanization of temporal deduction in the general setting. In particular, temp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2021
ISSN: ['0039-3215', '1572-8730']
DOI: https://doi.org/10.1007/s11225-020-09929-8